A New EDF Feasibility Test

نویسندگان

  • Bruno Gaujal
  • Nicolas Navet
چکیده

We present a new algorithm for testing the feasibility of a set of nonrecurrent tasks (or jobs) with real-time constraints scheduled under the EDF policy (Earliest Deadline First). The proposed feasibility test has a lower complexity than the previously known test. The rst step of the algorithm is to construct the Hasse diagram of the set of tasks where the partial order is de ned by the inclusion relation on the tasks. Then, the algorithm constructs the shortest path in a geometrical representation at each level of the Hasse diagram. Depending on the maximal slope of each path, the set of tasks is either feasible of not. The worst-case complexity of this feasibility test depends on structural characteristics of the set of jobs since it is the sum of the levels in the Hasse diagram. Whatever the set of jobs, this is better than the worst-case complexities of existing approaches. Furthermore, we provide a probabilistic analysis of the complexity when the tasks are random. For Poisson arrivals and exponentially distributed latencies, we show that the asymptotic complexity for assessing feasibility is O(N log(N)). As an interesting by-product, the algorithm provides a new way to derive the best speeds of the processor so as to minimize the total energy consumption while meeting the deadline of each task. The exact complexity of this algorithm (sub-cubic in the number of tasks) is lower than the complexity of all the algorithms solving the same problem, known by the authors. Key-words: Real-Time Systems, Scheduling, Feasibility, Dynamic Voltage Scaling, Earliest Deadline First. ∗ ENS Lyon LIP, 46 Allée d'Italie, 69007 Lyon, France. Email: [email protected] † LORIA, Ensem, 2 avenue de la Forêt de la Haye, 54516 Vandoeuvre, France. Email: [email protected] Unité de recherche INRIA Lorraine Technopôle de Nancy-Brabois, Campus scientifique, 615 rue de Jardin Botanique, BP 101, 54600 VILLERS LÈS NANCY (France) Téléphone : 03 83 59 30 30 International : +33 3 3 83 59 30 30 Télécopie : 03 83 27 83 19 International : +33 3 83 27 83 19 Antenne de Metz, technopôle de Metz 2000, 4 rue Marconi, 55070 METZ Téléphone : 03 87 20 35 00 International: +33 3 87 20 35 00 Télécopie : 03 87 76 39 77 International : +33 3 87 76 39 77 2 B. Gaujal, N. Navet

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Further improved schedulability analysis of EDF on multiprocessor platforms TR-051001

This report shows how to tighten the analysis of global EDF scheduling on multiprocessor platforms, so as to verify the feasibility of a significantly larger range of task systems than has been possible using the previously known tests, including those recently by Bertogna, Cirinei, and Lipari. The improved EDF feasibility test for sporadic task systems with arbitrary deadlines is proven correc...

متن کامل

Minimum EDF-Feasible Deadline Calculation with Low-Time Complexity

We present a method for calculating the minimum EDF-feasible deadline. The algorithm targets periodic tasks with hard real-time guarantees, that are to be feasibly scheduled with EDF (Earliest Deadline First). The output is the smallest possible deadline required for feasibility, of the task most recently requested. The good thing with our algorithm is that it has the same timecomplexity as the...

متن کامل

Improved Feasibility Tests for Asynchronous Real-Time Periodic Task Sets

The feasibility test for synchronous task systems scheduled by EDF is a well known problem in the literature. However, the analysis of task systems with deadlines shorter than the periods of the tasks has a high runtime complexity. This problem increases if we consider asynchronous task sets. In this paper, the runtime complexity of Pellizzoni’s approach to the analysis of asynchronous task set...

متن کامل

A Comparison of Global and Partitioned EDF Schedulability Tests for Multiprocessors TR-051101

This paper compares the performance of several variations on EDF-based global and partitioned multiprocessor scheduling algorithms, together with their associated feasibility tests, on a variety of pseudo-randomly chosen sets of sporadic tasks. A new hybrid EDF-based scheme is shown to perform better than previously studied priority-based global scheduling schemes, though not as well as EDF-bas...

متن کامل

Characteristics of EDF Schedulability on Uniform Multiprocessors

In uniform multiprocessor platforms, the various processors comprising the multiprocessor platform may have different computing capacities. The focus of this paper is the design of efficient tests for determining whether the Earliest Deadline First Scheduling Algorithm (EDF) can successfully schedule a given real-time task system to meet all deadlines upon a specified uniform multiprocessor pla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004